package acwing._2LanQiao._1Recursion;

import java.util.Scanner;

/**
 * @Project : ProgrammingExercises
 * @Package : ACWing._2LanQiao._1_1Recursion
 * @File : Q0717.java
 * @Author : WangRuoyu
 * @Date : 2023/3/12 20:08
 */

public class Q0717 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        if (n == 0) {
            System.out.println();
        } else if (n == 1) {
            System.out.println(0);
        } else {
            int[] f = new int[n];
            f[0] = 0;
            f[1] = 1;
            for (int i = 0; i < n; ++i) {
                if (i >= 2) {
                    f[i] = f[i - 1] + f[i - 2];
                }
                System.out.print(f[i] + " ");
            }
        }
    }
}